A Mutual Influence Algorithm for Multiple Concurrent Negotiations - A Game Theoretical Analysis
نویسندگان
چکیده
Buyers always want to obtain goods at the lowest price. To do so, a buyer agent can have multiple concurrent negotiations with all the sellers. It is obvious that if the buyer obtains a good price from one of the sellers, the buyer should have more bargaining power in negotiating with other sellers. Then, other sellers should offer a lower price in order to make a deal. In this way, the concurrent negotiations mutually influence one another. In this paper, we present an algorithm to enable mutual influence among multiple concurrent negotiations.
منابع مشابه
Real-Time Coordination of Concurrent Multiple Bilateral Negotiations under Time Constraints
This paper addresses a coordination problem during concurrent multiple bilateral negotiations. Real time decisions need to be taken during negotiation to ensure that the overall negotiation process is successful in terms of achieving a valuable agreement (an agreement with high utility). Existing approaches for managing concurrent multiple bilateral negotiation typically rely on historic inform...
متن کاملA Game Theoretical Approach to Optimize Policies of Government Under the Cartel of Two Green and Non-green Supply Chains
In this research, firms aim at maximizing two purposes of social welfare (environment) and profitability in the supply chain system. It is assumed that there are two supply chains, a green and an ordinary, each consists of a manufacturer and a supplier; in which the manufacturer generates profit through franchises. The green and the ordinary manufacturers form a cartel on the market of a certai...
متن کاملResearch of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information
Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...
متن کاملResearch of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information
Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...
متن کاملfinding influential individual in Social Network graphs using CSCS algorithm and shapley value in game theory
In recent years, the social networks analysis gains great deal of attention. Social networks have various applications in different areas namely predicting disease epidemic, search engines and viral advertisements. A key property of social networks is that interpersonal relationships can influence the decisions that they make. Finding the most influential nodes is important in social networks b...
متن کامل